منابع مشابه
Pebble Games for Rank Logics
We show that equivalence in finite-variable infinitary logic with rank operators can be characterised in terms of pebble games based on set partitions. This gives us a game-based method for proving lower bounds for FOR and IFPR, the extensions of first-order and fixed-point logic with rank operators, respectively. As an illustration of the game method, we establish that over finite structures, ...
متن کاملQTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
Quantics tensor train (QTT), a new data-sparse format for one– and multi–dimensional vectors, is based on a bit representation of mode indices followed by a separation of variables. A radix-2 reccurence, that lays behind the famous FFT algorithm, can be efficiently applied to vectors in the QTT format. If input and all intermediate vectors of the FFT algorithm have moderate QTT ranks, the resul...
متن کاملAdvantage of a quantum player over a classical one in 2 x 2 quantum games
We study a general 2×2 symmetric, entangled, quantum game. When one player has access only to classical strategies while the other can use the full range of quantum strategies, there are ‘miracle’ moves available to the quantum player that can direct the result of the game towards the quantum player’s preferred result regardless of the classical player’s strategy. The advantage pertaining to th...
متن کاملQuantum Games and Quantum Strategies
One might wonder what games and physics could have possibly in common. After all, games like chess or poker seem to heavily rely on bluffing, guessing and other activities of unphysical character. Yet, as was shown by von Neumann and Morgenstern [1], conscious choice is not essential for a theory of games. At the most abstract level, game theory is about numbers that entities are efficiently ac...
متن کاملQuantum Games and Quantum Algorithms
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2014
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-014-0096-x